Locating a Semi-Obnoxious Facility with Repelling Polygonal Regions
نویسندگان
چکیده
In this work, a semi-obnoxious facility must be located in the Euclidean plane to give service to a group of customers. Simultaneously, a set of populated areas, with shapes approximated via polygons, must be protected from the negative effects derived from that facility. The problem is formulated as a margin maximization model, following a strategy successfully used in Support Vector Machines. Necessary optimality conditions are studied and a finite dominating set of solutions is obtained, leading to a polynomial algorithm.
منابع مشابه
Locating a Semi-Obnoxious Facility on a Network with the Elliptic Maximin and Network Minisum Objectives
متن کامل
Obnoxious facility location: Complete service with minimal harm
We present e cient algorithms for several instances of the following facility location problem. (Facilities and demand sites are represented as points in the plane.) Place k obnoxious facilities, with respect to n given demand sites and m given regions, where the goal is to maximize the minimal distance between a demand site and a facility, under the constraint that each of the regions must con...
متن کاملMulticriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives
Locating a facility is often modeled as either the maxisum or the minisum problem, re ecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are both desirable and undesirable at the same time, e.g. an airport. This can be modeled as a multicriteria network location problem, where some of the sumobjectives are maximized (push e ect) and some of the sum-objectiv...
متن کاملComputing obnoxious 1-corner polygonal chains
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at two given points. In other words, given a set S of points in the plane and a positive value l0, we want to compute an anchored 1-corner polygonal chain having length at most l0 such that the minimum distance to the point...
متن کاملAn efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کامل